MINIMAX LOCATION PROBLEM WITH A-DISTANCE

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier

This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

متن کامل

Algebraic solutions to multidimensional minimax location problems with Chebyshev distance

Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and eigenvectors of an appropriate matrix. ...

متن کامل

Fuzzy Programming Models for Minimax Location Problem

This paper discusses the minimax location problem with fuzzy locations of customers on a plane bounded by a convex polygon under a minmax criterion. Three types of fuzzy programming are presented for this problem according to different criteria, and Euclidean distances are assumed as the scenario. For solving the proposed models, a hybrid intelligent algorithm is designed.

متن کامل

Facility Location with Minimax Envy

We study the problem of locating a public facility on a real line or an interval, when agents’ costs are their (expected) distances from the location of the facility. Our goal is to minimize the maximum envy over all agents, which we will refer to as the minimax envy objective, while at the same time ensuring that agents will report their most preferred locations truthfully. First, for the prob...

متن کامل

A New Algebraic Solution to Multidimensional Minimax Location Problems with Chebyshev Distance

Both unconstrained and constrained minimax single facility location problems are considered in multidimensional space with Chebyshev distance. A new solution approach is proposed within the framework of idempotent algebra to reduce the problems to solving linear vector equations and minimizing functionals defined on some idempotent semimodule. The approach offers a solution in a closed form tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 1998

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.41.181